Bisimulation Collapse and the Process Taxonomy
نویسندگان
چکیده
We consider the factorization (collapse) of infinite transition graphs wrt. bisimulation equivalence. It turns out that almost none of the more complex classes of the process taxonomy, which has been established in the last years, are preserved by this operation. However, for the class of BPA graphs (i.e. prefix transition graphs of context-free grammars) we can show that the factorization is effectively a regular graph, i.e. finitely representable by means of a deterministic hypergraph grammar. Since finiteness of regular graphs is decidable, this yields, as a corollary, a decision procedure for the finiteness problem of context-free processes wrt. bisimulation equivalence.
منابع مشابه
An Analysis and Taxonomy of Unstructured Workflows
Most workflow tools support structured workflows despite the fact that unstructured workflows can be more expressive. The reason for this is that unstructured workflows are more prone to errors. In this paper, we describe a taxonomy that serves as a framework for analyzing unstructured workflows. The taxonomy organizes unstructured workflows in terms of two considerations: improper nesting and ...
متن کاملTransformation from manufacturing process taxonomy to repair process taxonomy: a phenetic approach
The need of taxonomy is vital for knowledge sharing. This need has been portrayed by through-life engineering services/systems. This paper addresses this issue by repair process taxonomy development. Framework for repair process taxonomy was developed followed by its implementation. The importance of repair process taxonomy has been highlighted.
متن کاملBisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملOn the Bisimulation Congruence in χ-Calculus
In this paper, we study weak bisimulation congruences for the χ-calculus, a symmetric variant of the π-calculus. We distinguish two styles of such bisimulation definitions, i.e. “open” and “closed” bisimulation, the difference between which lies in that in open style the equivalence is closed under context in every bisimulation step whereas in closed style the equivalence is closed under contex...
متن کاملA Tractarian Universe
In this paper we develop a reconstruction of the Tractatus ontology. The basic idea is that objects are unsaturated and that Sachlagen are like molecules. Bisimulation is used for the proper individuation of the Sachlagen. We show that the ordering of the Sachlagen is a complete distributive, lattice. It is atomistic, i.e., each Sachlage is the supremum of the Sachverhalte below it. We exhibit ...
متن کامل